
#include "tree.h"



using namespace awa;

namespace xcom {

ObjectCollection::value_type Class_INode() {

  typedef boost::function1<Generic, xcom::INode* >         FnPtr0;
  
  Signature x;

  ObjectCollection::value_type ofnMapping("Node", map_list_of
					  (x = list_of("nodename"),       Impl(new FnPtr0(&INode::nodename)))
					  (x = list_of("nodevalue"),      Impl(new FnPtr0(&INode::nodevalue)))
					  (x = list_of("namespaceuri"),   Impl(new FnPtr0(&INode::namespaceuri)))
					  (x = list_of("prefx"),          Impl(new FnPtr0(&INode::prefx)))
					  (x = list_of("localname"),      Impl(new FnPtr0(&INode::localname)))
					  (x = list_of("baseuri"),        Impl(new FnPtr0(&INode::baseuri)))
					  (x = list_of("type"),           Impl(new FnPtr0(&INode::type)))
					  );
  return ofnMapping;
}

ObjectCollection::value_type Class_ITree() {

  typedef boost::function1<Generic, xcom::ITree* >                  FnPtr0;
  typedef boost::function2<Generic, xcom::ITree*, Generic >         FnPtr1;

  Signature x;
  
  ObjectCollection::value_type ofnMapping("Tree", map_list_of
					  (x = list_of("iseq")("Tree"),          Impl(new FnPtr1(&ITree::iseq)))
					  (x = list_of("lt")("Tree"),            Impl(new FnPtr1(&ITree::lt)))
					  (x = list_of("isneq")("Tree"),         Impl(new FnPtr1(&ITree::isneq)))
					  (x = list_of("gt")("Tree"),            Impl(new FnPtr1(&ITree::gt)))
					  (x = list_of("le")("Tree"),            Impl(new FnPtr1(&ITree::le)))
					  (x = list_of("ge")("Tree"),            Impl(new FnPtr1(&ITree::ge)))
					  (x = list_of("begin"),                 Impl(new FnPtr0(&ITree::begin)))
					  (x = list_of("end"),                   Impl(new FnPtr0(&ITree::end)))
					  (x = list_of("node_begin"),            Impl(new FnPtr0(&ITree::node_begin)))
					  (x = list_of("node_end"),              Impl(new FnPtr0(&ITree::node_end)))
					  (x = list_of("rbegin"),                Impl(new FnPtr0(&ITree::rbegin)))
					  (x = list_of("rend"),                  Impl(new FnPtr0(&ITree::rend)))
					  (x = list_of("pre_order_begin"),       Impl(new FnPtr0(&ITree::pre_order_begin)))
					  (x = list_of("pre_order_end"),         Impl(new FnPtr0(&ITree::pre_order_end)))
					  (x = list_of("post_order_begin"),      Impl(new FnPtr0(&ITree::post_order_begin)))
					  (x = list_of("post_order_end"),        Impl(new FnPtr0(&ITree::post_order_end)))
					  (x = list_of("level_order_begin"),     Impl(new FnPtr0(&ITree::level_order_begin)))
					  (x = list_of("level_order_end"),       Impl(new FnPtr0(&ITree::level_order_end)))
					  (x = list_of("node_rbegin"),           Impl(new FnPtr0(&ITree::node_rbegin)))
					  (x = list_of("node_rend"),             Impl(new FnPtr0(&ITree::node_rend)))
					  (x = list_of("pre_order_node_begin"),  Impl(new FnPtr0(&ITree::pre_order_node_begin)))
					  (x = list_of("pre_order_node_end"),    Impl(new FnPtr0(&ITree::pre_order_node_end)))
					  (x = list_of("post_order_node_begin"), Impl(new FnPtr0(&ITree::post_order_node_begin)))
					  (x = list_of("post_order_node_end"),   Impl(new FnPtr0(&ITree::post_order_node_end)))
					  (x = list_of("level_order_node_begin"),Impl(new FnPtr0(&ITree::level_order_node_begin)))
					  (x = list_of("_reserve"),              Impl(new FnPtr0(&ITree::reserve)))
					  (x = list_of("_push_back"),            Impl(new FnPtr0(&ITree::push_back)))
					  (x = list_of("_pop_back"),             Impl(new FnPtr0(&ITree::pop_back)))
					  (x = list_of("_insert_element")("Node"),Impl(new FnPtr1(&ITree::insert_element)))
					  (x = list_of("_insert_tree")("Tree"),  Impl(new FnPtr1(&ITree::insert_tree)))
					  (x = list_of("_set_element")("Node"),  Impl(new FnPtr1(&ITree::set_element)))
					  (x = list_of("_set_tree")("Tree"),     Impl(new FnPtr1(&ITree::set_tree)))
					  (x = list_of("_clear"),                Impl(new FnPtr0(&ITree::clear)))
					  (x = list_of("child_index"),           Impl(new FnPtr0(&ITree::child_index)))
					  (x = list_of("_sort"),                 Impl(new FnPtr0(&ITree::sort)))
					  (x = list_of("_sort_descendants"),     Impl(new FnPtr0(&ITree::sort_descendants)))
					  );
  return ofnMapping;
}


};
